One-inclusion hypergraph density revisited
نویسندگان
چکیده
In this paper, we show that the density of the one-inclusion hypergraph induced by a family of multi-valued functions is bounded by the pseudo-dimension of this family. (The original proof for this fact, that has been published quite recently, makes use of a wrong claim.) We show furthermore that the well-known graph-dimension is another upper bound on the density (which solves an open problem from [4]).
منابع مشابه
Corrigendum to "Shifting: One-inclusion mistake bounds and sample compression" [J. Comput. System Sci 75 (1) (2009) 37-59]
Article history: Received 8 February 2010 Available online 11 March 2010 H. Simon and B. Szörényi have found an error in the proof of Theorem 52 of “Shifting: One-inclusion mistake bounds and sample compression”, Rubinstein et al. (2009) [3]. In this note we provide a corrected proof of a slightly weakened version of this theorem. Our new bound on the density of one-inclusion hypergraphs is aga...
متن کاملThe density Turán problem for some 3-uniform unihypercyclic linear hypergraphs An efficient testing algorithm
Let H = (V, E) be a 3-uniform linear hypergraph with one hypercycle C3. We consider a blow-up hypergraph B[H]. We are interested in the following problem. We have to decide whether there exists a blow-up hypergraph B[H] of the hypergraph H, with hyperedge densities satisfying special conditions, such that the hypergraph H appears in a blow-up hypergraph as a transversal. We present an efficient...
متن کاملShifting, One-Inclusion Mistake Bounds and Tight Multiclass Expected Risk Bounds
Under the prediction model of learning, a prediction strategy is presented with an i.i.d. sample of n − 1 points in X and corresponding labels from a concept f ∈ F , and aims to minimize the worst-case probability of erring on an nth point. By exploiting the structure of F , Haussler et al. achieved a VC(F)/n bound for the natural one-inclusion prediction strategy, improving on bounds implied b...
متن کاملOn the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملThe Total Variation on Hypergraphs - Learning on Hypergraphs Revisited
Hypergraphs allow one to encode higher-order relationships in data and are thus a very flexible modeling tool. Current learning methods are either based on approximations of the hypergraphs via graphs or on tensor methods which are only applicable under special conditions. In this paper, we present a new learning framework on hypergraphs which fully uses the hypergraph structure. The key elemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 110 شماره
صفحات -
تاریخ انتشار 2010